Matching hyperspectral absorptions by weighted hamming distance

A Method for Defuzzication by Weighted Distance

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

Approximate Matching with No Bound on the Hamming Distance

Recall that given a pattern p = (p1, . . . , pm) and a text t = (t1, . . . , tn), we would like to find all matches with k or fewer mismatches, meaning positions i such that |{j : pj 6= ti+j−1}| ≤ k. Any such position will be called a k-mismatch. We showed in the previous lectures how to solve this problem in O(nk) time using constant time longest common extension (LCE) operations. Here we will...

Object Matching using Skeletonization based on Hamming Distance

Identification of an object from a dynamic background is a challenging process in computer vision and pattern matching research. The proposed algorithm identifies moving objects from the sequence of video frames which contains dynamically changing backgrounds in the noisy environment. In connection with our previous work, here we have proposed a methodology to perform skeletanization of an obje...